Business Process Graphs: Similarity Search and Matching
نویسندگان
چکیده
Organizations create collections of hundreds or even thousands of business process models to describe their operations. This chapter explains how graphs can be used as underlying formalism to develop techniques for managing such collections. To this end it defines the business process graph formalism. On this formalism it defines techniques for determining similarity of business process graphs. Such techniques can be used to quickly search through a collection of business process graphs to find the graph that is most relevant to a given query. These techniques can be used by tool builders that develop tools for managing large collections of business process models. The aim of the chapter is to provide an overview of the research area of using graphs to do similarity search and matching of business processes.
منابع مشابه
Graph Matching Algorithms for Business Process Model Similarity Search
We investigate the problem of ranking all process models in a repository according to their similarity with respect to a given process model. We focus specifically on the application of graph matching algorithms to this similarity search problem. Since the corresponding graph matching problem is NP-complete, we seek to find a compromise between computational complexity and quality of the comput...
متن کاملEvaluation of Similarity Measures for Template Matching
Image matching is a critical process in various photogrammetry, computer vision and remote sensing applications such as image registration, 3D model reconstruction, change detection, image fusion, pattern recognition, autonomous navigation, and digital elevation model (DEM) generation and orientation. The primary goal of the image matching process is to establish the correspondence between two ...
متن کاملSimilarity Search in Structured Data
Recently, structured data is getting more and more important in database applications, such as molecular biology, image retrieval or XML document retrieval. Attributed graphs are a natural model for the structured data in those applications. For the clustering and classification of such structured data, a similarity measure for attributed graphs is necessary. All known similarity measures for a...
متن کاملProviding Explanations for the Intelligent Monitoring of Business Workflows Using Case-Based Reasoning
This paper presents an approach for providing explanation to the intelligent diagnosis and monitoring of business workflows based on operation data in the form of temporal log data. The representation of workflow related case knowledge in this research using graphs is explained. Workflow cases are represented in terms of events and their corresponding temporal relationships. The matching and CB...
متن کاملFast Matching of Hierarchical Attributed Relational Graphs for an Application to Similarity-Based Image Retrieval
This paper describes the fast matching of hierarchical attributed relational graphs with the aim of applying the method to similarity-based image retrieval. Best-first search algorithm, admissible heuristic function, and maximum permissible cost are proposed to speed up the computation of graph matching. By means of these methods, the average computation time of graph matching speeds up about t...
متن کامل